Exponentials of Symmetric Matrices through Tridiagonal Reductions
نویسنده
چکیده
A simple and efficient numerical algorithm for computing the exponential of a symmetric matrix is developed in this paper. For an n× n matrix, the required number of operations is around 10/3 n. It is based on the orthogonal reduction to a tridiagonal form and the Chebyshev uniform approximation of e−x on [0,∞).
منابع مشابه
Tridiagonal-Diagonal Reduction of Symmetric Indefinite Pairs
We consider the reduction of a symmetric indefinite matrix pair (A,B), with B nonsingular, to tridiagonal-diagonal form by congruence transformations. This is an important reduction in solving polynomial eigenvalue problems with symmetric coefficient matrices and in frequency response computations. The pair is first reduced to symmetric-diagonal form. We describe three methods for reducing the ...
متن کاملSpectral Distributions and Isospectral Sets of Tridiagonal Matrices
We analyze the correspondence between finite sequences of finitely supported probability distributions and finite-dimensional, real, symmetric, tridiagonal matrices. In particular, we give an intrinsic description of the topology induced on sequences of distributions by the usual Euclidean structure on matrices. Our results provide an analytical tool with which to study ensembles of tridiagonal...
متن کاملThe Snap-Back Pivoting Method for Symmetric Banded Indefinite Matrices
The four existing stable factorization methods for symmetric indefinite pivoting (row or column exchanges) maintains a band structure in the reduced matrix and the factors, but destroys symmetry completely once an off-diagonal pivot is used. Two-by-two block pivoting maintains symmetry at all times, but quickly destroys the band structure. Gaussian reduction to tridiagonal also maintains symmet...
متن کاملOn tridiagonal matrices unitarily equivalent to normal matrices
In this article the unitary equivalence transformation of normal matrices to tridiagonal form is studied. It is well-known that any matrix is unitarily equivalent to a tridiagonal matrix. In case of a normal matrix the resulting tridiagonal inherits a strong relation between its superand subdiagonal elements. The corresponding elements of the superand subdiagonal will have the same absolute val...
متن کاملAn O(N2 ) Method for Computing the Eigensystem of N ˟ N Symmetric Tridiagonal Matrices by the Divide and Conquer Approach
An efficient method to solve the eigenproblem of N x N symmetric tridiagonal matrices is proposed. Unlike the standard eigensolvers that necessitate O(N3) operations to compute the eigenvectors of such matrices, the proposed method computes both the eigenvalues and eigenvectors with only O(N2) operations. The method is based on serial implementation of the recently introduced Divide and Conquer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998